%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : DAT157^1 : TPTP v8.1.2. Released v7.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : duper %s

% Computer : n001.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Aug 30 22:12:23 EDT 2023

% Result   : Theorem 9.66s 9.82s
% Output   : Proof 9.66s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem    : DAT157^1 : TPTP v8.1.2. Released v7.0.0.
% 0.00/0.15  % Command    : duper %s
% 0.15/0.37  % Computer : n001.cluster.edu
% 0.15/0.37  % Model    : x86_64 x86_64
% 0.15/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37  % Memory   : 8042.1875MB
% 0.15/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37  % CPULimit   : 300
% 0.15/0.37  % WCLimit    : 300
% 0.15/0.37  % DateTime   : Thu Aug 24 14:28:56 EDT 2023
% 0.15/0.37  % CPUTime    : 
% 9.66/9.82  SZS status Theorem for theBenchmark.p
% 9.66/9.82  SZS output start Proof for theBenchmark.p
% 9.66/9.82  Clause #31 (by assumption #[]): Eq (Exists fun X3 => And (member a X3 (coinductive_lset a ysa)) (less_eq x X3)) True
% 9.66/9.82  Clause #229 (by assumption #[]): Eq (∀ (Y5 : a), member a Y5 (coinductive_lset a ysa) → less_eq x Y5 → thesis) True
% 9.66/9.82  Clause #230 (by assumption #[]): Eq (Not thesis) True
% 9.66/9.82  Clause #231 (by clausification #[230]): Eq thesis False
% 9.66/9.82  Clause #232 (by clausification #[229]): ∀ (a_1 : a), Eq (member a a_1 (coinductive_lset a ysa) → less_eq x a_1 → thesis) True
% 9.66/9.82  Clause #233 (by clausification #[232]): ∀ (a_1 : a), Or (Eq (member a a_1 (coinductive_lset a ysa)) False) (Eq (less_eq x a_1 → thesis) True)
% 9.66/9.82  Clause #234 (by clausification #[233]): ∀ (a_1 : a), Or (Eq (member a a_1 (coinductive_lset a ysa)) False) (Or (Eq (less_eq x a_1) False) (Eq thesis True))
% 9.66/9.82  Clause #235 (by forward demodulation #[234, 231]): ∀ (a_1 : a), Or (Eq (member a a_1 (coinductive_lset a ysa)) False) (Or (Eq (less_eq x a_1) False) (Eq False True))
% 9.66/9.82  Clause #236 (by clausification #[235]): ∀ (a_1 : a), Or (Eq (member a a_1 (coinductive_lset a ysa)) False) (Eq (less_eq x a_1) False)
% 9.66/9.82  Clause #1185 (by clausification #[31]): ∀ (a_1 : a), Eq (And (member a (skS.0 12 a_1) (coinductive_lset a ysa)) (less_eq x (skS.0 12 a_1))) True
% 9.66/9.82  Clause #1186 (by clausification #[1185]): ∀ (a_1 : a), Eq (less_eq x (skS.0 12 a_1)) True
% 9.66/9.82  Clause #1187 (by clausification #[1185]): ∀ (a_1 : a), Eq (member a (skS.0 12 a_1) (coinductive_lset a ysa)) True
% 9.66/9.82  Clause #3168 (by superposition #[1187, 236]): ∀ (a_1 : a), Or (Eq True False) (Eq (less_eq x (skS.0 12 a_1)) False)
% 9.66/9.82  Clause #3213 (by clausification #[3168]): ∀ (a_1 : a), Eq (less_eq x (skS.0 12 a_1)) False
% 9.66/9.82  Clause #3214 (by superposition #[3213, 1186]): Eq False True
% 9.66/9.82  Clause #3222 (by clausification #[3214]): False
% 9.66/9.82  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------